Supplement to : Analysis and Comparison of Queues with Different Levels of Delay Information
نویسندگان
چکیده
• λ = arrival rate of potential customers • μ = service rate • W = waiting time in queue • θ = customer-type parameter, indicating the importance of time, θ ∈ [0, 1] • H = cumulative distribution function of θ, assumed continuous on [0, 1], with density h • c(w) = basic cost to wait time w, a positive, increasing, unbounded, continuous function • r = reward to the customer for receiving service, r > 0. • u = average utility 2. Solutions 2.1 No Information Assume that E[c(W |−)] is finite for any λ− < μ. Proposition 1 For no information, there exists a unique equilibrium arrival rate λ−.
منابع مشابه
MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملCross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملAnalysis and Comparison of Queues with Different Levels of Delay Information
Information about delays can enhance service quality in many industries. Delay information can take many forms, with different degrees of precision. Different levels of information have different effects on customers and so on the overall system. To explore these effects, we consider a queue with balking under three levels of delay information: no information, partial information (the system oc...
متن کاملA Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time
This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کامل